Efficient 3x3 Median Filter Computations

نویسنده

  • Manfred Kopp
چکیده

This Paper presents an efficient algorithm for median filtering with a 3x3 filter kernel with only about 9 comparisons per pixel using spatial coherence between neighbouring filter computations. The basic algorithm calculates two medians in one step and reuses sorted slices of three vertical neighbouring pixels. An extension of this algorithm for 2D spatial coherence is also examined, which calculates four medians per step. Even though theoretical results would yield 5% performance increase compared to the basic algorithm, experimental results showed less significant increase or even worse performance dependent on the hardware.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Alternate Algorithm for (3x3) Median Filtering of Digital Images

Median filtering is a commonly used technique in image processing. The main problem of the median filter is its high computational cost (for sorting N pixels, the temporal complexity is O(N·log N), even with the most efficient sorting algorithms). When the median filter must be carried out in real time, the software implementation in general-purpose processors does not usually give good results...

متن کامل

On the Roots of the 3×3 Median Filter

A characterization of the roots of the 3x3 median filter is given. We define the properties of local smoothness and of local roughness for the roots of the 3x3 median filter. Roots that are locally rough everywhere are binary and periodic; otherwise, unlike the 1D case, a root may be non binary or non periodic. This partially generalizes to dimension 2 the results of Brandt [1] and Tyan [2]; in...

متن کامل

FPGA Based Efficient Median Filter Implementation Using Xilinx System Generator

Digital Images are an important medium to convey visual information. However, digital images are often corrupted by noise. In this paper, an efficient implementation scheme for median filter is proposed, which is used to remove impulse noise from images. So, the resultant image of the filter is the image with reduced impulse noise. Impulse noise reduction is done using the application of the me...

متن کامل

A real-time bit-serial rank filter implementation using Xilinx FPGA

Rank filter is a non-linear filter used in image processing for impulse noise removal, morphological operations, and image enhancement. Real-time applications, such as video and high-speed acquisition cameras, often require the rank filter, and the much simpler median filter. Implementing the rank filter in hardware, can achieve the required speeds for these applications. Bit-serial algorithm c...

متن کامل

High Throughput Two- Dimensional Median Filters On FPGA for Image Processing Applications

An efficient hardware implementation of a median filter is presented. Input samples are used to construct a cumulative histogram, which is then used to find the median. The resource usage of the design is independent of window size, but rather, dependent on the number of bits in each input sample. This offers a realizable way of efficiently implementing large-windowed median filtering, as requi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994